Algorithm of Walsh - Hadamard Transform with Optical Approach ⋆
نویسندگان
چکیده
In this paper, the fast algorithm to Walsh-Hadamard transform (WHT) is studied from the point of view of the optical computation. Firstly, MSD addition and butterfly calculation in discrete WHT are presented in detail. Then the design and implementation scheme of fast algorithm of WHT is proposed and the software simulations to fast WHT are carried out optically. Meanwhile, the computational complexity of the algorithms in time and space are analyzed. The analysis shows that the problem of WHT with large-scale data can be solved in a few of clock cycles with optical computational method. The scheme also provides a good way for the design of fast optical Walsh-Hadamard transformer and an application in ternary optical computer.
منابع مشابه
Classifiers of Digital Modulation Based on the Algorithm of Fast Walsh-Hadamard Transform and Karhunen-Loeve Transform
متن کامل
Classifiers of Digital Modulation Based on the Algorithm of Fast Walsh-Hadamard Transform and Karhunen-Loeve Transform
متن کامل
Optimized Fast Walsh-Hadamard Transform on GPUs for non-binary LDPC decoding
The Fourier Transform Sum-Product Algorithm (FT-SPA) used in non-binary Low-Density Parity-Check (LDPC) decoding makes extensive use of the Walsh-Hadamard Transform (WHT). We have developed a massively parallel Fast Walsh-Hadamard Transform (FWHT) which exploits the Graphics Processing Unit (GPU) pipeline and memory hierarchy, thereby minimizing the level of memory bank conflicts and maximizing...
متن کاملRegistration of Brain Images using Fast Walsh Hadamard Transform
A lot of image registration techniques have been developed with great significance for data analysis in medicine, astrophotography, satellite imaging and few other areas. This work proposes a method for medical image registration using Fast Walsh Hadamard transform. This algorithm registers images of the same or different modalities. Each image bit is lengthened in terms of Fast Walsh Hadamard ...
متن کاملMultilayer Hadamard Decomposition of Discrete Hartley Transforms
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the so-called fast transforms. In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT. The appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013